Duality in generalized nonlinear fractional programming
نویسندگان
چکیده
منابع مشابه
Duality in generalized linear fractional programming
This is a generalization of a fractional programming problem (p = 1) which has been investigated quite actively in the last two decades [21 ]. In [20] many of the results in fractional programming are reviewed and extended. An extensive bibliography is given in [22]. An early application of generalized fractional programming (p > 1) is von Neumann's model of an expanding economy [25]. Here the ...
متن کاملDuality in nondifferentiable minimax fractional programming with generalized convexity
A Mond–Weir type dual for a class of nondifferentiable minimax fractional programming problem is considered. Appropriate duality results are proved involving (F,a,q,d)-pseudoconvex functions. 2005 Elsevier Inc. All rights reserved.
متن کاملDUALITY FOR NONLINEAR FRACTIONAL PROGRAMMING INVOLVING GENERALIZED ρ-SEMILOCALLY b-PREINVEX FUNCTIONS
We consider a nonlinear fractional programming problem with inequality constraints, where the functions involved are ρ-semilocally b-preinvex, ρ-semilocally explicitly b-preinvex, ρ-semilocally quasi b-preinvex, ρ-semilocally pseudo bpreinvex and ρ-semi-locally strongly pseudo b-preinvex functions. Necessary optimality conditions are obtained in terms of the right derivative of a function along...
متن کاملA study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming
This paper is concerned with the study of necessary and sufficient optimality conditions for convex–concave generalized fractional disjunctive programming problems for which the decision set is the union of a family of convex sets. The Lagrangian function for such problems is defined and the Kuhn–Tucker Saddle and Stationary points are characterized. In addition, some important theorems related...
متن کاملSufficiency and Duality of Fractional Integral Programming with Generalized Invexity
Convexity assumptions for fractional programming of variational type are relaxed to generalized invexity. The sufficient optimality conditions are employed to construct a mixed dual programming problem. It will involve the Wolfe type dual and Mond-Weir type dual as its special situations. Several duality theorems concerning weak, strong, and strict converse duality under the framework in mixed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1992
ISSN: 0022-247X
DOI: 10.1016/0022-247x(92)90099-y